Anything to Clarify? Report Your Parsing Ambiguities!
نویسندگان
چکیده
An important factor for the acceptance of spoken dialogue systems is their ability to react flexibly on misunderstandings between user and system. This paper addresses the issue of grounding utterances in task-oriented human-computer dialogues. It focuses on the aspect of handling ambiguities while parsing word lattices from a speech recognizer: The parser detects the origin and the type of ambiguities which are reported to the dialogue manager as comments to the list of readings for the user’s utterance. This way, disambiguation is delegated to the dialogue manager and accomplished either by exploiting the application situation or by initiating clarification dialogues that are suitable for the dialogue situation.
منابع مشابه
Flexible Table-Driven Parsing for Natural Language Processing
Ambiguity is a major difficulty for natural language processing (NLP) systems. The longer that ambiguities in a sentence remain unresolved, the more work an NLP system may perform in considering alternative interpretations of the sentence. Thus, for efficiency, an NLP system should resolve ambiguities as early as possible in processing. This report describes L parsing—an algorithm for table-dri...
متن کاملAmbiguity Management in Grammar Writing
When lingusitically motivated grammars are implemented on a larger scale, and applied to real-life corpora, keeping track of ambiguity sources becomes a difficult task. Yet it is of great importance, since unintended ambiguities arising from underrestricted rules or interactions have to be distinguished from linguistically warranted ambiguities. In this paper we report on various tools in the X...
متن کاملAmbiguity in Visual Language Theory and Its Role in Diagram Parsing
To take advantage of the ever-increasing volume of diagrams in electronic form, it is crucial that we have methods for parsing diagrams. Once a structured, content-based description is built for a diagram, it can be indexed for search, retrieval, and use. Whenever broadcoverage grammars are built to parse a wide range of objects, whether natural language or diagrams, the grammars will overgener...
متن کاملDeterministic Parsing And Unbounded Dependencies
This paper assesses two new approaches to deterministic parsing with respect to the analysis of unbounded dependencies (UDs). UDs in English are highly locally (and often globally) ambiguous. Several researchers have argued that the difficulty of UDs undermines the programme of deterministic parsing. However, their conclusion is based on critiques of various versions of the Marcus parser which ...
متن کاملHow To Deal With Ambiguities While Parsing: Exam - A Semantic Processing System For Japanese Language
It is difficult for a natural language understanding system (NLUS) to deal with ambiguities. There is a dilemma: an NLUS must be able to produce plausible interpretations for given sentences, avoiding the combinatorial explosion of possible interpretations. Furthermore, it is desirable for an NLUS to produce several interpretations if they are equally plausible. EXAM, the system described in th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002